Semi-continuous linear lattices
نویسندگان
چکیده
منابع مشابه
Completion of Lattices of Semi-continuous Functions
If U and V are topologies on an abstract set X, then the triple (X, U, V) is a bitopological space. Using the theorem of Priestley on the representation of distributive lattices, results of Dilworth concerning the normal completion of the lattice of bounded, continuous, realvalued functions on a topological space are extended to include the lattice of bounded, semi-continuous, real-valued funct...
متن کاملSolving Linear Equations in *-continuous Action Lattices
This work aims to investigate conditions under which program analysis can be viewed as algebraically solving equations involving terms of subclasses of Kleene algebras and variables. In this paper, we show how to solve a kind of linear equations in which variables appear only on one side of the equality sign, over a *-continuous action lattice. Furthermore, based on the method developed for sol...
متن کاملOn the (semi)lattices induced by continuous reducibilities
Studying discontinuity of functions is an interesting topic on its own, an observation that is fortified by noting that continuity behaves similar to computability in the framework of computable analysis. This suggests to compare the discontinuity of functions through continuous reducibilities. In the present paper, a continuous version of bounded Turing reducibility (≤2) and a continuous versi...
متن کاملA New Approach for Approximating Solution of Continuous Semi-Infinite Linear Programming
This paper describes a new optimization method for solving continuous semi-infinite linear problems. With regard to the dual properties, the problem is presented as a measure theoretical optimization problem, in which the existence of the solution is guaranteed. Then, on the basis of the atomic measure properties, a computation method was presented for obtaining the near optimal so...
متن کاملOptimal linear feature transformations for semi-continuous hidden Markov models
Linear discriminant or Karhunen-Lo eve transforms are established techniques for mapping features into a lower dimensional subspace. This paper introduces a uniform statistical framework, where the computation of the optimal feature reduction is formalized as a Maximum-Likelihood estimation problem. The experimental evaluation of this suggested extension of linear selection methods shows a slig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Mathematica
سال: 1971
ISSN: 0039-3223,1730-6337
DOI: 10.4064/sm-37-2-191-195